Sequential vs. Binary Batched Searching
نویسندگان
چکیده
منابع مشابه
Batched searching in database organizations
Savings in the number of page accesses due to batching on sequential, tree-structured, and random files are well known and have been reported in the literature. This paper asserts that substantial savings can also be obtained in database organizations by batching the requests for records (in queries), and also by batching intermediate processing requests while traversing the database. A simple ...
متن کاملBatched Search of Index Sequential Files
The performance of batched search when applied to index sequential files is studied. Analysis provides exact formulae for the cost of searching when batching is applied as a function of the magnitude of the query and time. The analysis takes into account (a) accesses to the overflow area only, and (b) accesses to both primary and overflow area, as well as whether the records of the query are (a...
متن کاملSearching vs . Navigating
There has been a dramatic increase in cellphone sales in recent years. Nowadays, cellphones have become common world-wide and they replace many devices which used to stand on their own, including cameras, music players and radio, GPS navigation systems and even personal computers. Several studies which examined personal information management have confirmed a preference for information retrieva...
متن کاملBinary vs. non-binary constraints
There are two well known transformations from non-binary constraints to binary constraints applicable to constraint satisfaction problems (CSPs) with finite domains: the dual transformation and the hidden (variable) transformation. We perform a detailed formal comparison of these two transformations. Our comparison focuses on two backtracking algorithms that maintain a local consistency propert...
متن کاملBinary Searching with Non - uniform
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not xed and depends on the last accessed element, such as data stored in magnetic or optical disk. We present an optimal algorithm for this problem that nds the optimal search strategy in O(n 3) time, which is the same time complexity of the simpler classical problem of xed costs. Next, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1986
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/29.4.368